The Uniform Error of Hyperinterpolation on the Sphere
نویسندگان
چکیده
This paper considers the problem of approximation of a continuous function on the unit sphere S ⊆ IR by a spherical polynomial from the space IPn of all spherical polynomials of degree ≤ n. For r = 3 it was shown in [16] that the hyperinterpolation approximation Lnf (which is the linear projection obtained by approximating the Fourier coefficients in the exact L2 orthogonal projection by a positive-weight quadrature rule that integrates exactly all polynomials of degree≤ 2n) has the exact order ‖Ln‖ ≍ n for its uniform norm, provided the underlying quadrature rule satisfies an additional ‘quadrature regularity’ assumption. This rate of growth is the same as that of ‖Pn‖, where Pnf is the L2 orthogonal projection, and is optimal among all linear projections on IPn for r = 3. For r ≥ 3 an upper bound on ‖Ln‖ of non-optimal asymptotic order O(n) also holds, without any special assumption on the quadrature rule. This paper first surveys these recent theoretical results, and then for the first time presents numerical results, both on the growth of the uniform norm of the hyperinterpolation operator up to degree 200, and on the uniform error in the approximation for a set of test functions.
منابع مشابه
Hyperinterpolation on the sphere
In this paper we survey hyperinterpolation on the sphere Sd, d ≥ 2. The hyperinterpolation operator Ln is a linear projection onto the space Pn(S) of spherical polynomials of degree≤ n, which is obtained from L2(S)-orthogonal projection onto Pn(S) by discretizing the integrals in the L2(S) inner products by a positive-weight numerical integration rule of polynomial degree of exactness 2n. Thus ...
متن کاملGeneralized Hyperinterpolation on the Sphere and the Newman–Shapiro Operators
Hyperinterpolation on the sphere, as introduced by Sloan in 1995, is a constructive approximation method which is favorable in comparison with interpolation, but still lacking in pointwise convergence in the uniform norm. For this reason we combine the idea of hyperinterpolation and of summation in a concept of generalized hyperinterpolation. This is no longer projectory, but convergent if a ma...
متن کاملOn Generalized Hyperinterpolation on the Sphere
It is shown that second-order results can be attained by the generalized hyperinterpolation operators on the sphere, which gives an affirmative answer to a question raised by Reimer in Constr. Approx. 18(2002), no. 2, 183–203.
متن کاملHow good can polynomial interpolation on the sphere be?
This paper explores the quality of polynomial interpolation approximations over the sphere Sr−1 ⊂ Rr in the uniform norm, principally for r = 3. Reimer [17] has shown there exist fundamental systems for which the norm ‖Λn‖ of the interpolation operator Λn, considered as a map from C(Sr−1) to C(Sr−1), is bounded by dn, where dn is the dimension of the space of all spherical polynomials of degree...
متن کاملCorrigendum: Regularized Least Squares Approximations on the Sphere Using Spherical Designs
Abstract. We consider polynomial approximation on the unit sphere S = {(x, y, z) ∈ R : x + y + z = 1} by a class of regularized discrete least squares methods, with novel choices for the regularization operator and the point sets of the discretization. We allow different kinds of rotationally invariant regularization operators, including the zero operator (in which case the approximation includ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999